Maximal assortative matching for complex network graphs
نویسندگان
چکیده
منابع مشابه
On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching
A maximal matching of a graph is the set of edges such that the addition of an edge to this set violates the property of matching (i.e., no two edges of the matching share a vertex). We use the notion of assortative index (ranges from -1 to 1) to evaluate the extent of similarity of the end vertices constituting the edges of a matching. A maximal matching of the edges whose assortative index is...
متن کاملAssortative Matching and Reputation
Consider Becker’s (1973) classic matching model, with unobserved fixed types and stochastic publicly observed output. If types are complementary, then matching is assortative in the known Bayesian posteriors (the ‘reputations’). We discover a robust failure of Becker’s result in the simplest dynamic two type version of this world. Assortative matching is generally neither efficient nor an equil...
متن کاملAssortative Matching and Search
In Becker’s (1973) neoclassical marriage market model, matching is positively assortative if types are complements: i.e. match output f(x, y) is supermodular in x and y. We reprise this famous result assuming timeintensive partner search and transferable output. We prove existence of a search equilibrium with a continuum of types, and then characterize matching. After showing that Becker’s cond...
متن کاملAssortative Matching with Large Firms∗
Technological progress allows firms to scale production processes over an increasingly large number of workers. This affects the size of the firm as well as the skill level of its workforce. We propose a unifying theory of production where management resolves a tradeoff between hiring more versus better workers. The span of control or size is therefore intimately intertwined with the sorting pa...
متن کاملMaximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal matchings, we introduce matchingcover pairs to efficiently handle maximality in the local structure, and develop a polynomial time algorithm. For path matchings, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Computer and Information Sciences
سال: 2016
ISSN: 1319-1578
DOI: 10.1016/j.jksuci.2015.10.004